Search results for "Orthogonal array"

showing 2 items of 2 documents

Balanced Asymmetrical Nearly Orthogonal Designs for first and second order effect estimation

2006

Abstract A method for constructing asymmetrical (mixed-level) designs, satisfying the balancing and interaction estimability requirements with a number of runs as small as possible, is proposed in this paper. The method, based on a heuristic procedure, uses a new optimality criterion formulated here. The proposed method demonstrates efficiency in terms of searching time and optimality of the attained designs. A complete collection of such asymmetrical designs with two- and three-level factors is available. A technological application is also presented.

Statistics and ProbabilityEstimationMathematical optimizationOptimality criterionSettore SECS-S/02 - Statistica Per La Ricerca Sperimentale E TecnologicaOrder effectStatistics Probability and UncertaintyHeuristic procedureBalancing asymmetrical (mixed-level) designs nearly orthogonal arrays optimality two- and three-level designsMathematicsJournal of Applied Statistics
researchProduct

Adversary Lower Bound for the k-sum Problem

2013

We prove a tight quantum query lower bound $\Omega(n^{k/(k+1)})$ for the problem of deciding whether there exist $k$ numbers among $n$ that sum up to a prescribed number, provided that the alphabet size is sufficiently large. This is an extended and simplified version of an earlier preprint of one of the authors arXiv:1204.5074.

FOS: Computer and information sciencesDiscrete mathematicsQuantum queryQuantum PhysicsFOS: Physical sciencesComputational Complexity (cs.CC)AdversaryOmegaUpper and lower boundsCombinatoricsComputer Science - Computational ComplexityOrthogonal arrayAlphabetQuantum Physics (quant-ph)Computer Science::Formal Languages and Automata TheoryMathematics
researchProduct